Multi-coloring and job-scheduling with assignment and incompatibility costs

Graph multi-coloring for a job scheduling application

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

Heuristics for a multi-machine multi-objective job scheduling problem with smoothing costs

We propose a new multi-objective job scheduling problem on non-identical machines involving job and machine dependent setup costs and times, as well as smoothing costs. Smoothing issues are very important in several settings, such as for example car production, since they allow to balance resource utilization over an assembly line. In this paper, we describe the problem, give a mixed integer li...

Concurrent Locomotive Assignment and Freight Train Scheduling

The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...

Parallel machine scheduling with nested job assignment restrictions

We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines. © 2009 Elsevier B.V. All rights reserved.